Singular optimal controls for stochastic recursive systems under convex control constraint
نویسندگان
چکیده
In this paper, we study two kinds of singular optimal controls (SOCs for short) problems where the systems governed by forward-backward stochastic differential equations (FBSDEs short), in which control has components: regular control, and one. Both drift diffusion terms may involve variable. The domain is postulated to be convex. Under certain assumptions, framework Malliavin calculus, derive pointwise second-order necessary conditions SOC classical sense. This condition described adjoint processes, a maximum on Hamiltonian supported an illustrative example. A new obtained as well. Besides, by-product, verification theorem SOCs derived via viscosity solutions without involving any derivatives value functions. It worth pointing out that wider applicability than restrictive theorems. Finally, focus connection between principle dynamic programming such problem assumption function smooth enough.
منابع مشابه
Stochastic singular optimal control problem of switching systems with constraints
*Correspondence: [email protected] Department of Industrial Engineering, Anadolu University, Eskisehir, Turkey Institute of Control Systems, ANAS, Baku, Azerbaijan Abstract This paper is devoted to the optimal control problem of switching system in which constraints on the state variable are given by inclusions. Using Ekeland’s variational principle, second-order necessary condition of ...
متن کاملH∞ control for singular stochastic systems
In this paper, we deal with the bounded real lemma for stochastic singular systems with multiplicative noises. Based on the adaptation of Itô calculus, the admissibility for this class of systems is defined and the bounded real lemma is derived using the mean square exponential stability. This lemma is then used to synthetize a H∞ output feedback controller for the considered class of systems t...
متن کاملOptimal rates for stochastic convex optimization under Tsybakov noise condition
We focus on the problem of minimizing a convex function f over a convex set S given T queries to a stochastic first order oracle. We argue that the complexity of convex minimization is only determined by the rate of growth of the function around its minimizer xf,S , as quantified by a Tsybakov-like noise condition. Specifically, we prove that if f grows at least as fast as ‖x − xf,S‖ around its...
متن کاملOptimal Coding Subgraph Selection under Survivability Constraint
Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...
متن کاملOptimal control for stochastic nonlinear singular system using neural networks
In this paper, optimal control for stochastic nonlinear singular system with quadratic performance is obtained using neural networks. The goal is to provide optimal control with reduced calculus effort by comparing the solutions of the matrix Riccati differential equation (MRDE) obtained from the well-known traditional Runge–Kutta (RK) method and nontraditional neural network method. To obtain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2021
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2020.124905